A Fault-tolerant Optimal Message Routing Methodology for Cube-connected-cycles Parallel Computers
نویسندگان
چکیده
A cube-connected-cycles (CCC) is a regular graph, suitable for constructing the interconnection network of parallel or multi-node computer systems. The CCC network possesses the features of symmetry, regularity, fault tolerance, and fixed degree of the network. Message delivery through an interconnection network sometimes fails due to processing node and/or link faults or simply because some processors are too busy to handle message transfer. To make a CCC-based parallel computer more resilient to node/link faults, this paper proposes an optimal routing method that guarantees to find a shortest path between the source and the destination nodes within a faulty CCC-based network if such a path exists. The proposed method is based on the concepts of radiation and backtracking and is able to find the shortest path with little impact on the network traffic load. The time complexity of our routing methodology is O(log N), where N is the number of nodes in the CCC architecture.
منابع مشابه
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes
The concept af virtual channels is extended to multiple, virtual communication systems that provide adaptability and fault tolerance in addition to being deadlock-free. A channel dependency graph is taken as the definition of what connections are possible and any routing function must use only those connections defined by it. Virtual interconnection networks allowing adaptive, deadlock-free rou...
متن کاملFault-tolerant Routing in Metacube
A new interconnection network with low-degree for very large parallel computers called metacube (MC) has been introduced recently. The MC network has short diameter similar to that of the hypercube. However, the degree of an MC network is much lower than that of a hypercube of the same size. More than one hundred of millions of nodes can be connected by an MC network with up to 6 links per node...
متن کاملOptimal Routing in the Cube-Connected Cycles Interconnection Network
An optimal message routing algorithm for thc cube-connected cycles processor interconnection network is described, and the average:message path length is derived assuming a uniform message routing distribution. The optimal algorithm is comparetl to one preViously proposed and is shown to have significanlly shorter average path length.
متن کاملX-Cube: A Variation of Cube-Connected-Cycles Network With Lower Average Routing Steps
A fundamental and important research area in parallel computing is design of high-performance interconnection networks for connecting the processors in parallel computers. This paper presents a new interconnection network X-cube, a variant of the Cube-Connected-Cycles (CCC), which has the same degree, and same diameter in the worst case as the CCC of the same size and a decreased number of rout...
متن کاملCayley graph connected cycles: A new class of fixed-degree interconnection networks
We introduce a new class of fixed-degree interconnection networks, called the Cayley graph connected cycles , which includes the well known cube-connected cycles as a special case. This class of networks is shown to be vertexsymmetric and maximally fault tolerant (if the given Cayley graph is maximally fault tolerant). We propose simple routing and broadcasting algorithms for these networks in ...
متن کامل